The number of polyhedral (3-connected planar) graphs
نویسنده
چکیده
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the the number of rooted c-nets of R.C. Mullin and P.J. Schellenberg and Liu Yanpei.
منابع مشابه
Algorithms for Drawing Polyhedra from 3-Connected Planar Graphs
Two algorithms for producing polyhedral representations for 3-connected planar graphs are discussed in the paper. One of them uses Tutte’s drawing algorithm [11] to produce 2D drawing. Then the drawing is lifted into 3D space obtaining a polyhedral embedding. The other is simple algorithm by G. Hart [4] for drawing canonical polyhedral representations. Some alternative aspects (physical model, ...
متن کاملOn topological aspects of orientations
1. Introduction Constrained orientations, that is orientations such that all the vertices have a prescribed indegree, relates to one another many combinatorial and topological properties such as arboricity, connectivity and planarity. These orientations are the basic tool to solve planar augmentation problems 2]. We are concerned with two classes of planar graphs: maximal planar graphs (i.e. po...
متن کاملThe Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems
In JM94] we used a branch and cut algorithm in order to determine a maximum weight planar subgraph of a given graph. One of the motivations was to produce a nice drawing of a given graph by drawing the found maximum planar subgraph, and then augmenting this drawing by the removed edges. Our experiments indicate that drawing algorithms for planar graphs which require 2-or 3-connectivity, resp. d...
متن کاملSome New Polyhedra with Vertex Degree 4 And/or 5 Only
A table of 4and 5-hedra of orders up to and including 22 is given. In 1981 we reported on the number of polyhedral graphs [5]. That work was a byproduct of the search for the lowest-order squared square, which was found in March 1978 [3]. The squaring problem is closely related to the theory of 3-connected planar graphs, as was first shown by Brooks, Smith, Stone, and Tutte [1] in 1940. In 1962...
متن کاملOn self duality of pathwidth in polyhedral graph embeddings
Let G be a 3-connected planar graph and G∗ be its dual. We show that the pathwidth of G∗ is at most 6 times the pathwidth of G. We prove this result by relating the pathwidth of a graph with the cut-width of its medial graph and we extend it to bounded genus embeddings. We also show that there exist 3-connected planar graphs such that the pathwidth of such a graph is at least 1.5 times the path...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 1996